maximum flow problem
英 [ˈmæksɪməm fləʊ ˈprɒbləm]
美 [ˈmæksɪməm floʊ ˈprɑːbləm]
网络 最大流问题; 最大流量问题
双语例句
- Research in the Algorithm on the Solution to the Maximum Network Flow Problem Base on Mark
基于标号法求解网络最大流算法的研究 - The model of assignment problem algorithm and the model of minimum rate with maximum flow model are the basic algorithm and model for optimizing locomotive working diagram. However, limitations occur when it comes to the optimization problem of locomotive working diagram partially under double-locomotive traction.
指派问题算法模型和最小费用最大流模型是机车周转图优化的基本算法和模型，对解决部分双机牵引情况下的机车运用优化问题，具有一定的局限性。 - The Maximum Flow Problem with Fuzzy Constraints
带模糊约束的最大流问题 - The Research of Maximum Flow Problem of Consuming Network
消耗性网络最大流问题研究 - Maximum Multicommodity Flow Problem with Budget Constraint
有预算限制的最大多种物资流问题 - The Retrospective Algorithm about Searching Augmenting Path of Maximum Feasible Flow Problem
最大可行流问题中增值链的一种回溯求解算法 - Last, making use of LK_YY, we solve the maximum cost minimum flow problem in traffic program of GIS.
最后利用LKYY解决了实际GIS系统中交通规划的最小费用最大流问题。 - The maximum flow problem is redefined by using the concept of saturated flow of a network, and a new method for solving the maximum flow problem, called the Graph Simplex Algorithm is presented.
提出网络饱和流的概念，重新定义了网络最大流问题，并提出了求解最大流的图单纯形算法。 - The Maximum Flow Problem of Considering Flow Lossing and Its Basic Features
考虑路损的最大流问题及其基本特征 - Graph Simplex Method for Solution of Maximum Flow Problem in a Network
网络最大流的图单纯形解法 - A solution to the maximum flow problem of network transmission via MPLS is proposed in this paper.
为解决大多数的流量工程问题和网络传输中的最大流问题，该文提出了基于多协议标签交换（MPLS）解决方案； - The minimum cut problem and maximum flow problem with both node and edge capacities in general networks can be easily reduced to the problem with only edge capacities.
在一般网络中，节点和边都有容量的最小截、最大流问题很容易转化为仅边有容量的问题。 - For the convenience to build decision-making supporting system related to the maximum profit flow problem, a numerical algorithm is presented in this paper for seeking the maximum profit flow in the transaction network. The theory, which the algorithm depends on, is proved strictly.
为了便于建立与最大利润流问题有关的决策支持系统，本文给出了一个交易网络中求最大利润流的数值算法，证明了算法的理论依据，并举例了说明算法的应用。 - The Inverse Maximum Flow Problem
最大流问题的逆问题 - The methodologies considers the shared information and Cooperation of Command which is important factor in NCW, and Convert the design of C2 organization into the Minimum Cost Maximum Flow Problem.
该方法充分考虑了网络化作战探测信息共享以及指控命令协同，并将网络化作战C2组织的最优设计问题转化为C2组织网络中探测信息和指控命令的最小费用最大流问题。 - Maximum Flow Based Model and Method of the Maximum Lifetime Problem of Sensor Networks
求解传感器网络最大生存时间的最大流算法 - The algorithm is faster than algorithms for general maximum flow problems and it has broken the O ( mn) time barrier of the maximum flow problem, so it is of much importance in theory and constitutes a more efficient algorithm for solving many real application problems.
该算法比通用的算法快.它已经突破了最大流问题的O（mn）时间障碍，具有较强的理论意义，也为解决许多实际应用问题提供了更有效的算法。 - The condition of the maximum flow problem was proposed and a mathematical model was set up. Two typical algorithms, i.e., Dinic flow decomposition barrier Algorithms and Goldberg Rao flow decomposition barrier Algorithms to tackle with the maximum-flow problem of networks were elaborated in details.
简述了网络最大流问题并给出相应的数学模型，在此基础上详细解析了网络最大流问题中的两个典型阻塞流算法：Dinic阻塞流算法、Goldberg和Rao的二分长度阻塞流算法。 - Maximum Concurrent Flow Problem with Budget Constraint
有预算限制的最大并行流问题 - Flows of iron ore imported are arranged reasonably by means of the fuzzy network flow programming method for maximum flow minimum cost problem.
运用网络流模糊规划方法按最大最小费用流问题对矿石货流进行了合理安排。 - We discuss maximum multicommodity flow problem with budget constraint, present fully polynomial time approximation scheme for this problem that is independent of the number of commodities k, the complexity of the algorithm is(ε~ (-2) m~ 2).
研究有预算限制的最大多种物资流问题，给出了这个问题的不依赖物资数k的全多项式时间近似算法，其算法复杂性是O~（-ε2m2）。 - Maximum Principles for an Unsaturated Flow Problem
非饱和土壤水流方程的极值原理 - This dissertation covers a problem that often arises in real life situations-the maximum flow problem. This problem is a classic combinatorial optimization problem, which arises in many engineering and scientific applications. It is also the important content of computer science and operational research.
网络最大流问题是一个经典的组合优化问题，是计算机科学和运筹学的重要内容，在工程领域和科学研究领域具有广泛的应用。 - In addition, the maximum flow problem is an important part of the network flow theory. It is a classic combination of optimization problems, but also can be seen as a special linear programming problem.
在网络优化领域，最大流问题是一个经典的组合优化问题。 - The maximum flow problem is a special problem in the network flow theory; the study target is to compute and study the maximum flow of a circulation network.
最大流问题是网络流现象中的特殊问题，它是研究通过一个流通网络的最大流量问题。 - Introduce the research background and significance of maximum flow problem.
纵观全文，主要工作如下：1.介绍了最大流问题研究的背景、意义以及研究现状。 - Moreover, due to the limitations of the computer hardware itself, for large-scale data, the classical algorithms are not able to solve the maximum flow problem even.
再次，受计算机硬件本身限制，对于大规模数据，经典算法甚至不能够求解最大流问题。